Clustering for Edge-Cost Minimization
نویسنده
چکیده
! "! #$ % & (') * "! & "! + ", ./ 0 1 2 3 "! 3 4 5 , 6. 71 8 " 9 "!
منابع مشابه
A particle swarm optimization algorithm for minimization analysis of cost-sensitive attack graphs
To prevent an exploit, the security analyst must implement a suitable countermeasure. In this paper, we consider cost-sensitive attack graphs (CAGs) for network vulnerability analysis. In these attack graphs, a weight is assigned to each countermeasure to represent the cost of its implementation. There may be multiple countermeasures with different weights for preventing a single exploit. Also,...
متن کاملAn edge detection technique using genetic algorithm-based optimization
-In this paper we present a genetic algorithm-based optimization technique for edge detection. The problem of edge detection is formulated as one of choosing a minimum cost edge configuration. The edge configurations are viewed as two-dimensional chromosomes with fitness values inversely proportional to their costs. The design of the crossover and the mutation operators in the context of the tw...
متن کاملEnergy cost minimization in an electric vehicle solar charging station via dynamic programming
Environmental crisis and shortage of fossil fuels make Electric Vehicles (EVs) alternatives for conventional vehicles. With growing numbers of EVs, the coordinated charging is necessary to prevent problems such as large peaks and power losses for grid and to minimize charging costs of EVs for EV owners. Therefore, this paper proposes an optimal charging schedule based on Dynamic Programming (DP...
متن کاملNatural scene text localization using edge color signature
Localizing text regions in images taken from natural scenes is one of the challenging problems dueto variations in font, size, color and orientation of text. In this paper, we introduce a new concept socalled Edge Color Signature for localizing text regions in an image. This method is able to localizeboth Farsi and English texts. In the proposed method rst a pyramid using diff...
متن کاملA Clustering Coefficient Network Formation Game
Social and other networks have been shown empirically to exhibit high edge clustering—that is, the density of local neighborhoods, as measured by the clustering coefficient, is often much larger than the overall edge density of the network. In social networks, a desire for tightknit circles of friendships — the colloquial “social clique” — is often cited as the primary driver of such structure....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 6 شماره
صفحات -
تاریخ انتشار 1999